Shanks Sequence Transformations and Anderson Acceleration
نویسنده
چکیده
This paper presents a general framework for Shanks transformations of sequences of elements in a vector space. It is shown that the Minimal Polynomial Extrapolation (MPE), the Modified Minimal Polynomial Extrapolation (MMPE), the Reduced Rank Extrapolation (RRE), the Vector Epsilon Algorithm (VEA), the Topological Epsilon Algorithm (TEA), and Anderson Acceleration (AA), which are standard general techniques designed for accelerating arbitrary sequences and/or solving nonlinear equations, all fall into this framework. Their properties and their connections with quasi-Newton and Broyden methods are studied. The paper then exploits this framework to compare these methods. In the linear case, it is known that AA and GMRES are ‘essentially’ equivalent in a certain sense while GMRES and RRE are mathematically equivalent. This paper discusses the connection between AA, the RRE, the MPE, and other methods in the nonlinear case.
منابع مشابه
Acceleration property for the E-algorithm and an application to the summation of series
The E-algorithm is the most general sequence transformation actually known, since it contains as particular cases almost all the sequence transformations discovered so far : Richardson polynomial extrapolation , Shanks' transformation , summation processes , Germain-Bonne transformation , Levin's generalized transformations , the process p and rational extrapolation. In 10] some results concern...
متن کاملComparison of acceleration techniques of analytical methods for solving differential equations of integer and fractional order
The work addressed in this paper is a comparative study between convergence of the acceleration techniques, diagonal pad'{e} approximants and shanks transforms, on Homotopy analysis method and Adomian decomposition method for solving differential equations of integer and fractional orders.
متن کاملAn Extended Multistep Shanks Transformation and Convergence Acceleration Algorithm with Their Convergence and Stability Analysis
The molecule solution of an extended discrete Lotka-Volterra equation is constructed, from which a new sequence transformation is proposed. A convergence acceleration algorithm for implementing this sequence transformation is found. It is proved that our new sequence transformation accelerates some kinds of linear sequences and factorial sequences with good numerical stability. Some numerical e...
متن کاملNonlinear Sequence Transformations for the Acceleration of Convergence and the Summation of Divergent Series
Slowly convergent series and sequences as well as divergent series occur quite frequently in the mathematical treatment of scientific problems. In this report, a large number of mainly nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series are discussed. Some of the sequence transformations of this report as for instance Wynn’s ǫ algorithm o...
متن کاملScalar Levin-type Sequence Transformations
Sequence transformations are important tools for the convergence acceleration of slowly convergent scalar sequences or series and for the summation of divergent series. The basic idea is to construct from a given sequence { sn} a new sequence { s ′ n} = T ({ sn} ) where each s ′ n depends on a finite number of elements sn1 , . . . , snm . Often, the sn are the partial sums of an infinite series...
متن کامل